Resetting the ClockDexras1 Defines a Path
نویسندگان
چکیده
منابع مشابه
Resetting the Clock Dexras1 Defines a Path
The signaling pathways by which light and activity shift the circadian clock are not well understood. In this issue of Neuron, Cheng et al. analyze mice lacking Dexras1 (a Ras family GTPase protein) and demonstrate an important role for G(i/o) signaling mediating both photic and nonphotic phase shifts of the circadian clock.
متن کاملResetting the path integrator: a basic condition for route-based navigation.
During short excursions away from home, some mammals are known to update their position with respect to their point of departure through path integration (dead reckoning) by processing internal (idiothetic) signals generated by rotations and translations. Path integration (PI) is a continuously ongoing process in which errors accumulate. To remain functional over longer excursions, PI needs to ...
متن کاملThe PAS Protein VIVID Defines a Clock-Associated Feedback Loop that Represses Light Input, Modulates Gating, and Regulates Clock Resetting
vvd, a gene regulating light responses in Neurospora, encodes a novel member of the PAS/LOV protein superfamily. VVD defines a circadian clock-associated autoregulatory feedback loop that influences light resetting, modulates circadian gating of input by connecting output and input, and regulates light adaptation. Rapidly light induced, vvd is an early repressor of light-regulated processes. Fu...
متن کاملResetting the suprachiasmatic nucleus clock.
Recent research on the cellular basis of circadian rhythmicity has stressed the importance of clock genes for the maintenance of normal rhythmicity. There have been tremendous advances in our understanding of the inter-relationships of the various genes known to generate the rhythms. We know relatively little, however, about the way animals maintain their rhythmicity under normal seasonally cha...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neuron
سال: 2004
ISSN: 0896-6273
DOI: 10.1016/s0896-6273(04)00537-9